Wireless network scheduling methods and apparatus based on both waiting time and occupancy

ABSTRACT

A scheduler is adapted to schedule packets or other data blocks for transmission from a plurality of transmission elements in timeslots in a communication system. The scheduler determines scaled capacity measures for respective ones of the transmission elements, with each of the scaled capacity measures being scaled by a combination of a waiting time and an occupancy for a corresponding one of the transmission elements. The scheduler selects one or more of the transmission elements for scheduling in a given one of the timeslots based on the scaled capacity measures. The scheduler in an illustrative embodiment may be implemented in a network processor integrated circuit or other processing device of the communication system.

RELATED APPLICATION

The present application is related to U.S. Patent Application AttorneyDocket No. Hamilton 6-2-4-3, filed concurrently herewith and entitled“High-Throughput Scheduler with Guaranteed Fairness for WirelessNetworks and Other Applications,” the disclosure of which isincorporated by reference herein.

FIELD OF THE INVENTION

The present invention relates generally to the field oftelecommunications, and more particularly to schedulers used to controlaccess to limited resources.

BACKGROUND OF THE INVENTION

In many telecommunications applications, a scheduler is used to resolvecontention among multiple tasks competing for a limited resource. Forexample, such a scheduler is commonly used in a network processor toschedule multiple traffic flows for transmission over a specifictransmission bandwidth.

A network processor generally controls the flow of data between aphysical transmission medium, such as a physical layer portion of anetwork, and a switch fabric in a router or other type of switch. Animportant function of a network processor involves the scheduling ofcells, packets or other data blocks, associated with the multipletraffic flows, for transmission to the switch fabric from the physicaltransmission medium of the network and vice versa. The network processorscheduler performs this function.

An efficient and flexible scheduler architecture capable of supportingmultiple scheduling algorithms is disclosed in U.S. patent applicationSer. No. 10/722,933, filed Nov. 26, 2003 in the name of inventors AsifQ. Khan et al. and entitled “Processor with Scheduler ArchitectureSupporting Multiple Distinct Scheduling Algorithms,” which is commonlyassigned herewith and incorporated by reference herein.

It is often desirable for a given scheduling algorithm implemented in anetwork processor or other processing device to be both simple and fair.Simplicity is important because the processing device hardware typicallydoes not have a large amount of time to make a given schedulingdecision, particularly in a high data rate environment. A good schedulershould also be fair. For example, it may allocate the bandwidthaccording to the weights of the users, with the higher-priority usersgetting more bandwidth than lower-priority users.

An example of a simple and fair scheduling algorithm is the WeightedRound-Robin (WRR) scheduling algorithm. Assume that in a giventelecommunications application there is a number of users competing forone resource, which can process one data block in each timeslot. Thescheduler must decide which user can send one data block to the serverin each timeslot. Each user has a weight to indicate its priority. Theuser with larger weight has higher priority. Under ideal conditions, theservices received by the users should be proportional to their weights.A WRR scheduler serves the users in proportion to their weights in around-robin fashion.

A problem with WRR is that it may cause long periods of burstiness. Thisis clearly not desirable in telecommunication systems, because longburstiness could overflow the buffers of user communication devices.Such burstiness becomes increasingly problematic in those practicalapplications in which the total number of users may be several hundredsor more.

Alternative scheduling algorithms are known which overcome theburstiness problem of WRR. These include, by way of example, WeightedFair Queuing (WFQ) and Worst-case Fair Weighted Fair Queueing (WF²Q).Unfortunately, these alternative algorithms are typically considerablymore complex than WRR, and therefore may be difficult to implement innetwork processors and other processing devices operating in high datarate environments.

U.S. patent application Ser. No. 10/903,954, filed Jul. 30, 2004 in thename of inventors Jinhui Li et al. and entitled “Frame MappingScheduler,” which is commonly assigned herewith and incorporated byreference herein, discloses in an illustrative embodiment a framemapping scheduler that provides simplicity and fairness comparable tothat of WRR, but without the burstiness problem commonly associated withWRR. More specifically, a frame mapping scheduler in the illustrativeembodiment described therein comprises scheduling circuitry whichutilizes a weight table and a mapping table. The weight table comprisesa plurality of entries, with each of the entries identifying aparticular one of the transmission elements. The mapping table comprisesat least one entry specifying a mapping between a particular timeslot ofa frame and an entry of the weight table. The scheduling circuitrydetermines a particular transmission element to be scheduled in a giventimeslot by accessing a corresponding mapping table entry and utilizinga resultant value to access the weight table. The mapping table entriesmay be predetermined in accordance with a golden ratio policy, or othertype of policy.

However, in schedulers which utilize a golden ratio policy, or moregenerally any policy that requires a stored mapping table, the mappingtable may be large and therefore require substantial amounts of memory.It is usually preferred that such mapping table memory be arranged“on-chip,” that is, on the same integrated circuit as the scheduler, soas to reduce access times. For example, such an arrangement isbeneficial in network processing applications in which data blocks mayneed to be processed substantially in real time.

U.S. patent application Ser. No. 10/998,686, filed Nov. 29, 2004 in thename of inventors Jinhui Li et al. and entitled “Frame Mapping Schedulerwith Compressed Mapping Table,” which is commonly assigned herewith andincorporated by reference herein, discloses techniques for compressingthe mapping table in order to reduce the amount of memory required tostore the table, thereby facilitating its implementation in a networkprocessor integrated circuit or other device comprising a frame mappingscheduler.

The known arrangements described above can be utilized in a wide varietyof telecommunications applications, including applications involvingwireless networks. However, scheduling in the wireless network contextcan be particularly challenging because channel capacities in a wirelessnetwork are typically time varying and difficult to predict. It isimportant in such situations that the wireless network schedulerprovides not only fairness, but also sufficient throughput.

Examples of scheduling algorithms utilized in the wireless networkcontext include the above-described WRR scheduling algorithm and itsunweighted counterpart round robin (RR), maximum carrier-to-interferenceratio (Max C/I), Proportional Fairness (PF) and Modified LargestWeighted Delay First (M-LWDF).

A drawback of the RR scheduling algorithm is that it does not considerthe channel conditions. Instead, the RR scheduling algorithm simplyschedules backlogged users one by one, with the first user beingassigned to the first timeslot, the second user being assigned to thesecond timeslot, and so on, regardless of their respective channelcapacities. Such an approach is fair, because in a given set of Ntimeslots, each of N users has exactly one chance to be served. However,the throughput of the RR algorithm is poor, because it does not checkthe channel capacities before it makes the scheduling decisions. The WRRscheduling algorithm similarly fails to take channel capacities intoaccount in its scheduling decisions.

The Max C/I scheduling algorithm selects for a given timeslot the userthat has the best channel capacity. Although this approach can achievethe maximum overall throughput, its fairness performance is very poor.For example, if the wireless link of a given mobile user is constantlyweak, that user is not likely to be scheduled.

The PF scheduling algorithm selects the user that has the maximumr_(i)/R_(i), where r_(i) is the channel capacity of user i and R_(i) isthe average rate received by user i. The algorithm updates R_(i)adaptively. Thus, mobile users with weak wireless links will haveopportunities to be scheduled. Additional details regarding the PFscheduling algorithm can be found in, for example, A. Jalali et al.,“Data throughput of CDMA-HDR a high efficiency high data rate personalcommunication wireless system,” in Proc. of IEEE VTC 2000, pp.1854-1858, May 2000. The fairness of the PF scheduling algorithm isbetter than that of the Max C/I scheduling algorithm, but not as good asthat of the RR or WRR scheduling algorithms. Also, the PF schedulingalgorithm cannot provide guaranteed fairness.

The M-LWDF scheduling algorithm gives higher priorities to the usersthat have longer waiting times. However, like the above-described PFscheduling algorithm, it fails to provide guaranteed fairness.

Accordingly, the Max C/I, PF and M-LWDF scheduling algorithms providebetter throughput than the RR and WRR scheduling algorithms in thewireless context by sacrificing fairness.

The above-cited U.S. patent application Attorney Docket No. Hamilton6-2-4-3 provides improved scheduling algorithms which exhibit a betterbalance between throughput and fairness, particularly in wirelessnetwork applications. In an illustrative embodiment, the algorithm isreferred to as a Wireless RR (WiRR) scheduling algorithm. In thisembodiment, all transmission elements are initially designated aseligible for service in a given frame, but once a particulartransmission element is served in a timeslot of the given frame, it isconsidered ineligible for service in any subsequent timeslots of thatframe. The process is repeated for additional frames, and for each newframe the transmission elements are all initially designated as eligibleto transmit one or more data blocks in that frame.

Despite the considerable advances provided by the WiRR schedulingalgorithm and its variants, a need remains for further advances,particularly in wireless network applications. For example, theabove-noted M-LWDF algorithm generally has a queue length which,although bounded under admissible arrivals, may be quite large, andtherefore the queues may be difficult to implement in network processorintegrated circuits or other types of hardware. A modified algorithmhaving associated queues which can be implemented using less memory orother hardware resources would be desirable.

SUMMARY OF THE INVENTION

The present invention in one or more illustrative embodiments provideswireless scheduling algorithms that can be implemented using shorterqueues, and thus with reduced amounts of memory and other hardwareresources, relative to conventional scheduling algorithms such as theabove-noted M-LWDF scheduling algorithm.

In accordance with one aspect of the invention, a scheduler is adaptedto schedule packets or other data blocks for transmission from aplurality of transmission elements in timeslots in a communicationsystem. The scheduler determines scaled capacity measures for respectiveones of the transmission elements, wherein each of the scaled capacitymeasures is scaled by a combination of a waiting time and an occupancyfor a corresponding one of the transmission elements. The schedulerselects one or more of the transmission elements for scheduling in agiven one of the timeslots based on the scaled capacity measures. Theprocess may be repeated for one or more additional timeslots. Thetimeslots may, but need not, be timeslots of a frame in thecommunication system.

In a first illustrative embodiment, the scaled capacity measures aregiven by (α_(i)W_(i)+β₁O_(i))r_(i), for values of i=1 to N, where Ndenotes the number of transmission elements, α_(i) and β_(i) areconstants for transmission element i, W_(i) is the waiting time of aparticular data block of transmission element i, O_(i) is the occupancyof the transmission element i, and r_(i) is channel capacity oftransmission element i. The transmission element i may comprise a queue,with W_(i) being the waiting time of a head-of-line packet in queue i.

In a second illustrative embodiment, the scaled capacity measures aregiven by (α_(i)Δ_(i)+β_(i))O_(i)r_(i), for values of i=1 to N, where Ndenotes the number of transmission elements, α_(i) and β_(i) areconstants for transmission element i, Δ_(i) is the waiting time oftransmission element i, O_(i) is the occupancy of the transmissionelement i, and r_(i) is channel capacity of transmission element i. Thequantity Δ_(i) may be defined as T_(c)-T_(last), where T_(c) is acurrent time and T_(last) is a latest time when transmission element iis scheduled.

The scheduling algorithms are particularly well suited for use inwireless network applications, but can also be utilized in numerousother applications.

In accordance with another aspect of the invention, two or more of thetransmission elements may be selected for scheduling in the giventimeslot based on the selected transmission elements havingsubstantially the same scaled capacity measures. In such a “tie”situation, the two or more selected transmission elements may all bescheduled in the given timeslot by assigning different subsets of a setof available codes to different ones of the selected transmissionelements. For example, the timeslots may comprise HSDPA timeslots eachhaving an available set of codes. In such an arrangement, multiple userscan be scheduled in a given one of the HSDPA timeslots by assigningdifferent codes to the users.

The scheduler in an illustrative embodiment may be implemented in anetwork processor integrated circuit or other processing device of thecommunication system, using a wide variety of different arrangements ofscheduling circuitry.

Advantageously, the scheduling algorithms described in conjunction withthe illustrative embodiments overcome the excessive queue length problemassociated with the convention M-LWDF scheduling algorithm, therebyresulting in more hardware-efficient implementations. In addition, theillustrative embodiments can provide reduced complexity, for example, byreducing time stamping requirements and more efficiently handling tiesby accommodating multiple users in a single timeslot.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a simplified block diagram of a communication systemcomprising a wireless network in an illustrative embodiment of thepresent invention.

FIG. 2 shows one possible implementation of at least a portion of thecommunication system of FIG. 1.

FIG. 3 is a flow diagram of an improved wireless scheduling algorithmimplemented in a scheduler of the FIG. 1 communication system in oneembodiment of the present invention.

FIG. 4 is a flow diagram showing an alternative version of the FIG. 3scheduling algorithm.

FIG. 5 is a table which shows an example of the operation of thewireless scheduling algorithms of FIGS. 3 and 4 in an HSDPA application.

FIG. 6 shows another possible implementation of at least a portion ofthe FIG. 1 communication system.

FIG. 7 is a block diagram of a network processor of the FIG. 6 systemshown as an integrated circuit installed on a line card of a router orswitch.

FIG. 8 is a more detailed view of a network processor of the FIG. 6system configured in accordance with the techniques of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The invention will be illustrated herein in conjunction with exemplarywireless networks and other types of communication systems. Theexemplary systems include respective schedulers configured in aparticular manner in order to illustrate the techniques of theinvention. It should be understood, however, that the invention is moregenerally applicable to any communication system scheduler in which itis desirable to provide improved performance relative to theconventional scheduling algorithms described above.

FIG. 1 shows a simplified diagram of a communication system 100 inaccordance with an illustrative embodiment of the invention. The system100 comprises a scheduler 102 coupled to a transmitter 104 and a channelstatus element 106. The scheduler is coupled to transmission elementswhich in this embodiment comprise respective queues 110-1, 110-2, . . .110-N for respective ones of N users. In this example, the N users aremobile users of a wireless network of the system 100, and are associatedwith respective mobile user devices 112-1, 112-2, . . . 112-N whichcommunicate with transmitter 104 in a conventional manner. Thetransmitter 104 may comprise, for example, at least a portion of a basestation or access point of the wireless network.

The wireless network is configured for communication of packets or otherarrangements of data between transmitter 104 and the mobile user devices112. All such arrangements of data are intended to be encompassed by thegeneral term “data block” as used herein. It is to be appreciated thatthe invention does not require any particular size or configuration ofdata blocks. For simplicity and clarity of illustration, the diagramshows only the downlink communication between transmitter 104 and themobile user devices 112, although it is to be appreciated that similartechniques may be used for other types of transmission.

The system 100 in this embodiment maintains one queue 110 for eachmobile user 112, although other types of queuing arrangements may beused. Downlink transmissions are assumed to occur in timeslots. Thetimeslots may be timeslots of a frame, but the invention does notrequire that the timeslots be timeslots of a frame. During eachtimeslot, the scheduler 102 serves one or more of the users. Thescheduler in this embodiment is assumed to have knowledge of thewireless channel capacities associated with the respective mobile users.This knowledge may be provided to the scheduler by the channel statuselement 106, or using other techniques. As indicated previously, thechannel capacities associated with the mobile users are typically timevarying and difficult to predict. The scheduler bases its schedulingdecisions on the actual measured channel conditions and otherparameters, as will be described in greater detail below in conjunctionwith FIGS. 3 through 5. For a given timeslot, the scheduler selects oneor more of the user queues 110 which will each be scheduled to transmita packet during that timeslot. A given packet is transmitted viatransmitter 104 to the corresponding one of the mobile user devices 112.

The system 100 of FIG. 1 may be implemented, for example, as anotherwise conventional Universal Mobile Telecommunications System (UMTS)or Wideband Code Division Multiple Access (WCDMA) wireless cellularcommunication system. In such an implementation, system 100′ as shown inFIG. 2 comprises a radio network controller (RNC) 120 coupled to basestations 122, 124 and 126 as shown. The base stations 122, 124 and 126are referred to as Node B elements in accordance with well-known UMTSand WCDMA nomenclature. These elements communicate with the mobile userdevices 112, which are referred to as user equipment (UE) elements inthe UMTS and WCDMA context. The scheduler 102 and channel status element106 of the FIG. 1 system may be incorporated in the RNC 120, or may bereplicated in each of the Node B elements 122, 124 and 126. For example,if the UMTS or WCDMA system 100′ is configured to provide high speeddownlink packet access (HSDPA) capability, a scheduler is typicallyarranged in each Node B element so as to permit fast scheduling.

The above-noted HSDPA capability utilizes timeslots referred to astransmission time intervals (TTIs), and one or more users can be servedwithin each TTI. The HSDPA feature can be provided in a frequencydivision duplex (FDD) mode or a time division duplex (TDD) mode. In theFDD mode, a given TTI has a duration of 2 milliseconds (ms), while inthe TDD mode, a given TTI could be 5 ms or 10 ms. These and other TTIsare intended to be encompassed by the general term “timeslot” as usedherein.

In the UMTS or WCDMA context, the communication system channel typicallyused in HSDPA to send data to the UEs from a given Node B is referred toas the high speed downlink shared channel (HS-DSCH).

For simplicity and clarity of illustration, the scheduler 102 asdescribed below will be assumed to serve a single user per timeslot, butit should be understood that the described techniques can be extended ina straightforward manner to accommodate HSDPA and other arrangements inwhich multiple users can be scheduled in a single timeslot, as will beillustrated in conjunction with FIG. 5.

It should also be pointed out that the particular arrangements ofelements shown in FIGS. 1 and 2 are by way of illustrative example only.More specifically, as previously noted, the invention can be implementedin any type of wireless network or other communication system, and isnot limited to any particular communication application.

The scheduler 102 is configured to schedule packets or other data blocksfor transmission from the user queues 110 in timeslots. The scheduler inthe illustrative embodiments implements scheduling algorithms whichsimultaneously consider both waiting time and queue occupancy, whichadvantageously allows queue size to be reduced, thereby conservingmemory and other hardware resources.

Generally, the scheduler 102 determines scaled capacity measures forrespective ones of the N queues 110 of FIG. 1, with each of the scaledcapacity measures being scaled by a combination of both waiting time andoccupancy for a corresponding one of the queues. The scheduler thenselects one or more of the queues for scheduling in a given one of thetimeslots based on the scaled capacity measures. These operations aretypically repeated for additional timeslots. In alternative embodiments,transmission elements other than queues may be used. The transmissionelements may also be referred to herein as “users” in describing theexemplary scheduling algorithms below. Thus, operations described belowas being performed with reference to a user may be considered as beingperformed with reference to the associated transmission element, andvice-versa.

The scheduling algorithms in the illustrative embodiments are similar insome respects to the above-mentioned conventional M-LWDF schedulingalgorithm. The M-LWDF scheduling algorithm is described in greaterdetail in M. Andrews et al., “Providing Quality of Service over a SharedWireless Link,” IEEE Communication Magazine, Vol. 39, pp. 150-154,February 2001, which is incorporated by reference herein.

In each timeslot, the M-LWDF scheduling algorithm picks the user thathas the maximum (α_(i)W_(i)r_(i)), where α_(i) is a bandwidth allocationconstant for user i, W_(i) is the waiting time of a head-of-line packetin queue i, and r_(i) is the channel capacity associated with user i. Itis known that the conventional M-LWDF scheduling algorithm is“throughput optimal,” which means that it can guarantee bounded orfinite queue lengths. This throughput optimality property is preservedif W_(i) is replaced with O_(i), the occupancy of the queue. Asindicated previously, a problem with M-LWDF is that the queue lengths,although bounded, are often quite long, and therefore can consumeexcessive memory and other hardware resources in a given implementation.

The present invention in the illustrative embodiments overcomes thisproblem of conventional M-LWDF by simultaneously considering bothwaiting time and queue occupancy in making the scheduling decisions. Asnoted above, this allows queue size to be reduced, thereby conservingmemory and other hardware resources.

More particular examples of the improved scheduling algorithm will nowbe described with reference to the flow diagrams of FIGS. 3 and 4. Thescheduling algorithms in these examples have substantially the samefairness and throughput performance as the conventional M-LWDFscheduling algorithm, but exhibit reduced queue length.

In the examples to be described in conjunction with FIGS. 3 and 4, thetimeslots are assumed without limitation to be timeslots of a frame.However, as indicated previously, the timeslots need not be part of aframe, and instead could be entirely separate and independent timeslots.In the scheduling algorithms of the illustrative embodiments, schedulingdecisions are made independently for each of the timeslots, and so thetimeslots do not require any type of framing.

Referring initially to FIG. 3, the operation of a first version of theimproved scheduling algorithm, as implemented by scheduler 102 in system100 of FIG. 1, is shown.

In step 300, the scheduling process begins for a new frame.

In step 302, for the next available timeslot of the frame, the scheduler102 selects the particular one of the N users that has the maximum(α_(i)W_(i)+β_(i)O_(i))r_(i), for values of i=1 to N, where α_(i) andβ_(i) are constants for queue i, W_(i) is the waiting time of ahead-of-line packet in queue i, O_(i) is the occupancy of queue i, andr_(i) is channel capacity of queue i.

In these and other examples described herein, it is assumed forsimplicity and clarity of illustration that all of the N users arebacklogged at all times. Users are considered backlogged if they have atleast one packet to transmit. With reference to the diagram of FIG. 1,it can be seen that each of the users illustrated, namely, users 1, 2, 3and N, is backlogged in that each has at least one packet in itsassociated queue.

The foregoing backlogged user assumption, and other assumptions madeherein, need not apply in other embodiments. For example, in alternativeembodiments users that are not backlogged in the current timeslot may beremoved from consideration in the scheduling process for that timeslot,as will be appreciated by those skilled in the art. However, it shouldbe understood that users that are not backlogged in the current timeslotmay become backlogged in the next timeslot, and so removing such usersfrom consideration in scheduling the current timeslot should not beconstrued as removing them from consideration for the remainder of theframe.

In step 304, the selected user is served in the available timeslot. Theselected user is “served” in this example by scheduling a packet fromthe corresponding user queue 110 for transmission in the availabletimeslot.

In step 306, a determination is made as to whether any additionaltimeslots are available in the current frame. If not, the processreturns to step 300 to start a new frame. However, if there areadditional timeslot available in the current frame, the process returnsto step 302 to schedule one or more of users in additional timeslots ofthe current frame.

As indicated above, the scheduling decision in step 302 is madeindependently for each timeslot, and the timeslots need not be organizedin frames. Thus, steps 300 and 306 may be eliminated in an alternativeembodiment, or the frame may be viewed as having frame size=1, such thateach frame comprises only a single timeslot.

When two or more users are determined by the scheduler 102 to have thesame maximum (α_(i)W_(i)+β_(i)O_(i))r_(i) in a given instance of step302, the tie can be broken randomly, or the user with the smaller indexi can be selected. Another technique for dealing with such ties,suitable for use in the above-noted HSDPA context or other contexts inwhich multiple users can be served in a given timeslot, is to serve theusers simultaneously in the given timeslot, as will be illustrated inconjunction with FIG. 5.

It can be seen that, when the constant β_(i) is set to zero in the FIG.3 scheduling algorithm, the FIG. 3 algorithm reduces to the conventionalM-LWDF algorithm. As indicated above, the FIG. 3 algorithm providesfairness and throughput performance which is substantially the same asthat of the conventional M-LWDF algorithm, but also provides anadvantageous reduction in required queue length. The reduced queuelength may be expressed as a reduction in average queue length, that is,the average required length across the N queues 110 in the FIG. 1system. The FIG. 3 algorithm is also throughput optimal.

The quantity (α_(i)W_(i)+β_(i)O_(i))r_(i) in the foregoing embodiment isan example of what is more generally referred to herein as a scaledcapacity measure. Those skilled in the art will appreciate that othertypes of scaled capacity measures which incorporate scaling based onboth waiting time and occupancy can be used. Another example will bedescribed with reference to the flow diagram of FIG. 4.

The particular values of α_(i) and β_(i) used in a given implementationmay vary depending upon the scheduling needs of the implementation, andsuitable values can be determined in a straightforward manner. By way ofexample, α_(i) and β_(i) may both be set to one, or to 0.5, althoughother values could of course be used. The same set of α_(i) and β_(i)values may be used for all values of i, or different values may beestablished for at least some of the values of i.

As noted above, in the FIG. 3 algorithm, W_(i) is the waiting time ofthe head-of-line packet in queue i. Assume that the head-of-line packetwas enqueued at time T_(in). At a given current time T_(c), the waitingtime of the packet is given by T_(c)-T_(in). Accordingly, the FIG. 3algorithm generally requires that all the packets be time stamped uponarrival in their respective queues, such that the waiting times W_(i)can be determined. The FIG. 4 algorithm is a simplified version of theFIG. 3 algorithm which avoids the need to time stamp each packet.

The FIG. 4 algorithm defines a quantity Δ_(i)=T_(c)-T_(last) whereT_(last) as the latest time when queue i is scheduled. The quantityΔ_(i) is a representation of the waiting time of queue i, but one whichdoes not require the time stamping of every arriving packet. Instead,only a single time stamp need be associated with each of the queues. Thesimplified algorithm of FIG. 4 uses the product Δ_(i)O_(i) to replaceW_(i) in the FIG. 3 algorithm. Thus, in each timeslot, the schedulerselects the user that has the maximum (α_(i)Δ_(i)+β_(i))O_(i)r_(i).Since only the queues are time stamped, rather than each and everypacket, the complexity is considerably reduced.

Referring now to FIG. 4, the operation of the simplified version of theimproved scheduling algorithm, as implemented by scheduler 102 in system100 of FIG. 1, is shown.

In step 400, the scheduling process begins for a new frame.

In step 402, for the next available timeslot of the frame, the scheduler102 selects the particular one of the N users that has the maximum(α_(i)Δ_(i)+β_(i))O_(i)r_(i), for values of i=1 to N, where α_(i) andβ_(i) are constants for queue i, Δ_(i) is the waiting time of the queuei as defined above, O_(i) is the occupancy of queue i, and r_(i) ischannel capacity of queue i.

In step 404, the selected user is served in the available timeslot.Again, the selected user is “served” in this example by scheduling apacket from the corresponding user queue 110 for transmission in theavailable timeslot.

In step 406, a determination is made as to whether any additionaltimeslots are available in the current frame. If not, the processreturns to step 400 to start a new frame. However, if there areadditional timeslot available in the current frame, the process returnsto step 402 to schedule one or more of users in additional timeslots ofthe current frame.

As in FIG. 3, the scheduling decision in step 402 is made independentlyfor each timeslot, and the timeslots need not be organized in frames.Thus, steps 400 and 406 may be eliminated in an alternative embodiment,or the frame may be viewed as having frame size=1, such that each framecomprises only a single timeslot.

Again, ties arising in a given instance of step 402 can be handled usingthe techniques described previously.

An alternative version of the FIG. 4 scheduling algorithm can begenerated by setting the constant β_(i) to zero. In this variant, thescaled capacity measure which is utilized to make scheduling decisionsin step 402 is (α_(i)Δ_(i)O_(i)r_(i)). This is yet another example of ascaled capacity measure which is scaled by both waiting time andoccupancy.

As noted above, ties can be handled in certain embodiments by schedulingmultiple users in the same timeslot. For example, if two or more of theusers are determined in a given instance of step 302 or 402 to havesubstantially the same scaled capacity measures, the two or more usersmay be selected for scheduling and all such selected users may bescheduled in the given timeslot by assigning different subsets of a setof available codes to different ones of the selected users. The set ofavailable codes may comprise a set of HSDPA codes.

FIG. 5 shows an example of scheduling of multiple users in each of anumber of different HSDPA timeslots. In this example, the set ofavailable codes comprises a set of ten codes, denoted Code 1 throughCode 10. Each timeslot comprises an FDD mode TTI having a duration of 2ms. Different shadings in the figure represent different users. Up toten different users can be scheduled in a given one of the timeslots, byassigning one or more of the codes to each of the users.

It should be noted that the particular number of codes used in thisexample is for purposes of illustration only, and more or fewer codesmay be used in other embodiments. As indicated above, the HS-DSCHchannel is typically used in HSDPA to send data to the mobile users froma given Node B. Up to fifteen codes may be assigned to this channel.Thus, the ten codes shown in FIG. 5 represent just one example of a setof codes that may be used.

In the first timeslot shown in the figure, three users are scheduled,one assigned four codes and two others assigned three codes each. In thesecond and third timeslots, only a single user is scheduled, and isassigned all ten codes in each timeslot. In the fourth timeslot, twousers are scheduled, with each assigned five of the ten available codes.The remaining timeslots shown are scheduled in a similar manner.

The scheduling of multiple users in a single timeslot as described abovecan be applied in contexts other than HSDPA, and may be implementedusing other arrangements of timeslots and codes.

In a typical wireless network, mobile users are frequently removed fromor added to a network or a particular cell or other coverage area of thenetwork. The scheduler 102 may be configured to handle users removed oradded, during a given frame or otherwise. For users that are removed,the scheduler can simply designate those users as ineligible orotherwise eliminate the users from consideration in the schedulingprocess. For new users that are added, the scheduler can, by way ofexample, wait until a new frame starts, or set an eligibility status ofthe new user proportionally, randomly or using other techniques.

Advantageously, the scheduling algorithms described in conjunction withthe illustrative embodiments of FIGS. 3 to 5 overcome the excessivequeue length problem associated with the convention M-LWDF schedulingalgorithm, thereby resulting in more hardware-efficient implementations.In addition, the illustrative embodiments can provide reducedcomplexity, for example, by reducing time stamping requirements and moreefficiently handling ties by accommodating multiple users in a singletimeslot.

The scheduler 102 may be implemented at least in part in the form of anintegrated circuit, as will be described in greater detail below. Suchan integrated circuit may comprise a network processor or other type ofprocessor or processing device that is implemented in a givencommunication system element, such as a base station or access pointassociated with transmitter 104 in the FIG. 1 system, or an RNC or NodeB element in the FIG. 2 system.

The scheduler 102 may be, for example, a frame mapping scheduler, of thetype described in the above-cited U.S. patent application Ser. Nos.10/903,954 and 10/998,686. The use of these techniques can substantiallyreduce the amount of memory required to store a mapping table for agolden ratio policy or any other policy that requires a stored mappingtable.

It should be noted that the scheduling techniques of the presentinvention may also or alternatively be used in conjunction with aflexible scheduler architecture capable of supporting multiplescheduling algorithms, such as that disclosed in the above-cited U.S.patent application Ser. No. 10/722,933.

As indicated previously, the scheduling algorithms described herein canbe implemented in many other types of communication systems. Anotherexample system will now be described with reference to FIGS. 6 through8. In these figures, a scheduling algorithm is implemented in ascheduler of a network processor. Such a network processor may be usedin systems comprising wireless networks as shown in FIGS. 1 and 2, butcan also be used in other types of systems, such as the communicationsystem 600 shown in FIG. 6.

The system 600 includes a network processor 602 having an internalmemory 604. The network processor 602 is coupled to an external memory606 as shown, and is configured to provide an interface forcommunicating packets or other arrangements of data between a network608 and a switch fabric 610. As noted previously, all such arrangementsof data are intended to be encompassed by the general term “data block”as used herein. The network 608 may be a wireless network, correspondingto a portion of one of the wireless networks in the systems of FIGS. 1and 2, while the network processor 602 and switch fabric 610 may beimplemented in base stations, network controllers or other elements suchsystems.

The network processor 602 and its associated external memory 606 may beimplemented, e.g., as one or more integrated circuits installed on aline card or port card of a router, switch or other system element.

FIG. 7 illustrates an example line card embodiment of a portion of thesystem 600 of FIG. 6. In this embodiment, the system comprises a linecard 700 having at least one integrated circuit 702 installed thereon.The integrated circuit 702 comprises network processor 602 which hasinternal memory 604. The network processor 602 interacts with externalmemory 606 on the line card 700. The external memory 606 may serve,e.g., as an external static random access memory (SRAM) or dynamicrandom access memory (DRAM) for the network processor integrated circuit702. Such memories may be configured in a conventional manner, and maybe utilized to store scheduling information such as the above-describedscaled capacity measures or related scaling factors. A suitable hostprocessor may also be installed on the line card 700, and used forprogramming and otherwise controlling the operation of one or morenetwork processor integrated circuits on the line card 700.

The portion of the communication system as shown in FIGS. 6 and 7 isconsiderably simplified for clarity of illustration. It is to beappreciated, however, that the system may comprise a router, switch orother element which includes multiple line cards such as that shown inFIG. 7, and that each of the line cards may include multiple integratedcircuits. A similar embodiment may be implemented in the form of a portcard. However, the invention does not require such card-basedimplementation in a router, switch or other element.

It should also be understood that the particular arrangements ofelements shown in FIGS. 6 and 7 are by way of illustrative example only.More specifically, as previously noted, the invention can be implementedin any type of processor or other communication system processingdevice, and is not limited to any particular network-based processingapplication.

A “processor” as the term is used herein may be implemented, by way ofexample and without limitation, utilizing elements such as thosecommonly associated with a microprocessor, central processing unit(CPU), digital signal processor (DSP), application-specific integratedcircuit (ASIC), or other type of data processing device, as well asportions and combinations of such elements.

Also, the system 600 and network processor 602 as illustrated in FIGS. 6and 7 may include other elements in addition to or in place of thosespecifically shown, including one or more elements of a type commonlyfound in a conventional implementation of such a system and networkprocessor. For example, the network processor may include a classifier,queuing and dispatch logic, one or more memory controllers, interfacecircuitry for interfacing the network processor with the network 608,the switch fabric 610, a host processor or other external device(s), aswell as other conventional elements not explicitly shown in the figure.These and other conventional elements, being well understood by thoseskilled in the art, are not described in detail herein.

The functionality of the network processor 602 as described herein maybe implemented at least in part in the form of software program code.For example, elements associated with the performance of schedulingoperations in the network processor may be implemented at least in partutilizing elements that are programmable via instructions or othersoftware that may be supplied to the network processor via an externalhost processor or other suitable mechanism. For example, informationcharacterizing particular scheduling algorithms, or associated trafficshaping information, may be supplied to the network processor from theassociated host processor or other suitable mechanism.

FIG. 8 shows a more detailed view of the network processor 602 in anillustrative embodiment of the invention. The network processor 602 inthis embodiment includes a scheduler 800, transmit queues 802, a trafficshaper 804, a weight table 810, and a mapping table 812. In operation,the scheduler 800 schedules data blocks associated with the transmitqueues 802 for transmission over one or more transmission media whichare not explicitly shown. The scheduling utilizes the weight table 810and mapping table 812, in conjunction with traffic shaping informationfrom the traffic shaper 804 or without such information, in schedulingthe data blocks associated with the transmit queues 802 fortransmission.

As indicated previously, the network processor 602 may includeadditional elements, for example, of a type described in the above-citedU.S. patent applications, or of a conventional type known to thoseskilled in the art, and such elements, being described elsewhere, arenot further described herein.

The weight table 810 and mapping table 812 may be stored at least inpart in the internal memory 604 of the network processor 602, and mayalso or alternatively be stored at least in part in the external memory606 of the network processor 602. When stored using internal memory, atleast a portion of such memory may be internal to the scheduler 800 orother scheduling circuitry.

In addition to the table elements 810 and 812, scheduler 800 may includeor otherwise have associated therewith a number of additional timeslottables or other types of table elements suitable for use in static ordynamic table-based scheduling of a type described in the above-citedU.S. patent applications, or of a type known in conventional practice.

The transmit queues 802 may be viewed as comprising a pluralityoftransmission elements. For example, the transmit queues may comprise aplurality of transmission queues and associated control logic, with eachof the transmission queues corresponding to a transmission element. Itshould be noted, however, that the term “transmission element” as usedherein is intended to be construed more generally so as to encompass anysource of one or more data blocks, or other elements that areschedulable for transmission in the network processor 602.

Packets or other data blocks can be enqueued in transmission elements ofthe transmit queues 802 from an associated network processor data path,not explicitly shown in the figure. This may occur in conjunction withpacket enqueue messages and associated data blocks received from such adata path. Similarly, packets or other data blocks can be dequeued fromthe transmission elements to the data path upon transmission, forexample, in conjunction with packet dequeue messages and associated datablocks being sent to the data path.

The traffic shaper 804 may be implemented, by way of example, as anotherwise conventional traffic shaping engine which establishes one ormore traffic shaping requirements, in a known manner, for thetransmission of the data blocks from the transmission elements of thetransmit queues 802. The traffic shaper 804 may receive informationregarding queue and scheduler status from the transmit queues 802 viathe scheduler 800. The traffic shaper may generate traffic shapinginformation such as queue transmission interval and prioritization forestablishing a class of service (CoS) or other desired service level forone or more of the transmission elements or their corresponding networkconnections.

As indicated above, in the network processor context the transmissionelements, that is, the entities to be scheduled, may comprise queues.The present invention, however, can be used to schedule any type ofelements for which data blocks are to be transmitted, and more generallyany type of schedulable elements in a communication system processingdevice. Such elements are intended to be encompassed by the general term“transmission elements” as used herein, and as indicated previously mayalso be referred to herein as “users.” The scheduler 800 in the FIG. 8embodiment is configured to implement a scheduling algorithm such as theabove-described scheduling algorithms of FIGS. 3 and 4.

The schedulers 102 and 800 are illustrative examples of what is referredto more generally herein as “scheduling circuitry.” In otherembodiments, scheduling circuitry may include one or more tables orother arrangements of one or more of hardware, software and firmwarecapable of implementing the scheduling techniques described herein.Thus, although shown as separate from the scheduler 800 in the figure,the weight table 810 and the mapping table 812 or suitable portionsthereof may be at least partially incorporated into scheduling circuitryor an associated memory in accordance with the invention.

The schedulers 102 and 800 may utilize any arrangement of logic gates,processing elements or other circuitry capable of providing schedulingfunctionality of the type described herein. Scheduling circuitry inaccordance with the invention may thus comprise otherwise conventionalgeneral-purpose network processor circuitry which is adaptable undersoftware control to provide at least a portion of a scheduling functionin accordance with the invention. Numerous such circuitry arrangementswill be readily apparent to those skilled in the art, and are thereforenot described in detail herein.

As indicated above, a given embodiment of the present invention can beimplemented as one or more integrated circuits. In such an arrangement,a plurality of identical die is typically formed in a repeated patternon a surface of a wafer. Each die may include a device as describedherein, and may include other structures or circuits. The individual dieare cut or diced from the wafer, then packaged as an integrated circuit.One skilled in the art would know how to dice wafers and package die toproduce integrated circuits. Integrated circuits so manufactured areconsidered part of this invention.

Again, it should be emphasized that the above-described embodiments ofthe invention are intended to be illustrative only. For example,although the illustrative embodiment of FIG. 8 utilizes a schedulerwhich is separate from its associated table or tables, these elements orportions thereof may be incorporated into scheduling circuitry inaccordance with the invention. Similarly, although transmit queues 802and traffic shaper 804 are described as being separate from scheduler800 in conjunction with the FIG. 8 embodiment, the associatedfunctionality may be implemented at least in part within schedulingcircuitry in accordance with the invention. Other embodiments can usedifferent types and arrangements of processing elements for implementingthe described functionality. For example, the tables may be implementedin internal memory, external memory or combinations of internal andexternal memory. In the case of internal memory, at least a portion ofsuch memory may be internal to the scheduling circuitry. The particularprocess steps of the scheduling algorithms may be varied in alternativeembodiments, and a wide variety of different scheduling policies can besupported. These and numerous other alternative embodiments within thescope of the following claims will be apparent to those skilled in theart.

1. A method for scheduling data blocks for transmission from a pluralityof transmission elements in timeslots in a communication system, themethod comprising: determining for the transmission elements respectivescaled capacity measures, each of said scaled capacity measures beingscaled by a combination of a waiting time and an occupancy for acorresponding one of the transmission elements; and selecting one ormore of the transmission elements for scheduling in a given one of thetimeslots based on the scaled capacity measures.
 2. The method of claim1 wherein the transmission elements comprise respective queues.
 3. Themethod of claim 1 wherein the determining and selecting steps arerepeated for one or more additional timeslots.
 4. The method of claim 1wherein the scaled capacity measures are given by(α_(i)W_(i)+β_(i)O_(i))r_(i), for values of i=1 to N, where N denotesthe number of transmission elements, α_(i) and β_(i) are constants fortransmission element i, W_(i) is the waiting time of a particular datablock of transmission element i, O_(i) is the occupancy of thetransmission element i, and r_(i) is channel capacity of transmissionelement i.
 5. The method of claim 4 wherein transmission element icomprises a queue, and W_(i) is the waiting time of a head-of-linepacket in queue i.
 6. The method of claim 1 wherein the scaled capacitymeasures are given by (α_(i)Δ_(i)+β_(i))O_(i)r_(i), for values of i=1 toN, where N denotes the number of transmission elements, α_(i) and β_(i)are constants for transmission element i, Δ_(i) is the waiting time oftransmission element i, O_(i) is the occupancy of the transmissionelement i, and r_(i) is channel capacity of transmission element i. 7.The method of claim 6 wherein Δ_(i) is defined as T_(c)-T_(last), whereT_(c) is a current time and T_(last) is a latest time when transmissionelement i is scheduled.
 8. The method of claim 1 wherein the scaledcapacity measures are given by (α_(i)Δ_(i)O_(i)r_(i)), for values of i=1to N, where N denotes the number of transmission elements, α_(i) is aconstant for transmission element i, Δ_(i) is the waiting time oftransmission element i, O_(i) is the occupancy of the transmissionelement i, and r_(i) is channel capacity of transmission element i. 9.The method of claim 8 wherein Δ_(i) is defined as T_(c)-T_(last), whereT_(c) is a current time and T_(last) is a latest time when transmissionelement i is scheduled.
 10. The method of claim 1 wherein the timeslotscomprises HSDPA timeslots.
 11. The method of claim 1 wherein two or moreof the transmission elements are selected for scheduling in the giventimeslot based on said selected transmission elements havingsubstantially the same scaled capacity measures, said selectedtransmission elements all being scheduled in the given timeslot byassigning different subsets of a set of available codes to differentones of said selected transmission elements.
 12. The method of claim 11wherein the set of available codes comprises a set of HSDPA codes. 13.The method of claim 11 wherein the set of available codes comprises aset of codes assigned to an HS-DSCH channel of the system.
 14. Themethod of claim 1 wherein the timeslots comprise timeslots of a frame.15. An apparatus for scheduling data blocks for transmission from aplurality of transmission elements in timeslots in a communicationsystem, the apparatus comprising: a scheduler coupled to thetransmission elements; the scheduler being adapted to determine for thetransmission elements respective scaled capacity measures, each of saidscaled capacity measures being scaled by a combination of a waiting timeand an occupancy for a corresponding one of the transmission elements,and to select one or more of the transmission elements for scheduling ina given one of the timeslots based on the scaled capacity measures. 16.The apparatus of claim 15 wherein the scheduler comprises schedulingcircuitry implemented in a processing device of the communicationsystem.
 17. The apparatus of claim 16 wherein the processing devicecomprises a network processor integrated circuit.
 18. An integratedcircuit comprising: a processing device having a scheduler configured toschedule data blocks for transmission from a plurality of transmissionelements in timeslots in a communication system; the scheduler beingcoupled to the transmission elements; the scheduler being adapted todetermine for the transmission elements respective scaled capacitymeasures, each of said scaled capacity measures being scaled by acombination of a waiting time and an occupancy for a corresponding oneof the transmission elements, and to select one or more of thetransmission elements for scheduling in a given one of the timeslotsbased on the scaled capacity measures.
 19. The integrated circuit ofclaim 18 further comprising memory circuitry associated with saidprocessing device and adapted for storage of one or more of said scaledcapacity measures.
 20. The integrated circuit of claim 18 wherein thescheduler is implemented at least in part in the form of softwarerunning on the processing device.